An Outer Approximation Method for the Variational Inequality Problem
نویسندگان
چکیده
We study two outer approximation schemes, applied to the variational inequality problem in reflexive Banach spaces. First we pro∗Research of this author was supported by CAPES Grant BEX 0664-02/2. †Partially supported by PICDT/UFPI-CAPES ‡Partially supported by CNPq Grant 301200/93-9(RN) and by PRONEX– Optimization.
منابع مشابه
An Iterative Scheme for Generalized Equilibrium, Variational Inequality and Fixed Point Problems Based on the Extragradient Method
The problem ofgeneralized equilibrium problem is very general in the different subjects .Optimization problems, variational inequalities, Nash equilibrium problem and minimax problems are as special cases of generalized equilibrium problem. The purpose of this paper is to investigate the problem of approximating a common element of the set of generalized equilibrium problem, variational inequal...
متن کاملApproximation of fixed points for a continuous representation of nonexpansive mappings in Hilbert spaces
This paper introduces an implicit scheme for a continuous representation of nonexpansive mappings on a closed convex subset of a Hilbert space with respect to a sequence of invariant means defined on an appropriate space of bounded, continuous real valued functions of the semigroup. The main result is to prove the strong convergence of the proposed implicit scheme to the unique solutio...
متن کاملA Relaxed Extra Gradient Approximation Method of Two Inverse-Strongly Monotone Mappings for a General System of Variational Inequalities, Fixed Point and Equilibrium Problems
متن کامل
Iterative algorithms for families of variational inequalities fixed points and equilibrium problems
متن کامل
Local Linear Convergence of an Outer Approximation Projection Method for Variational Inequalities
Abstract: This paper considers an outer approximation projection method for variational inequalities, in which the projections are not performed on the original set that appears in the variational inequality, but on a polyhedral convex set defined by the linearized constraints. It shows that the method converges linearly, when the starting point is sufficiently close to the solution and the ste...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Control and Optimization
دوره 43 شماره
صفحات -
تاریخ انتشار 2005